acyclic orientation

мат.
ациклическая ориентация

English-Russian scientific dictionary. 2008.

Смотреть что такое "acyclic orientation" в других словарях:

  • Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

  • Directed acyclic graph — Graphe acyclique orienté Un exemple de graphe acyclique orienté Dans la théorie des graphes, un graphe acyclique orienté (en anglais directed acyclic graph ou DAG) identifie un graphe qui ne possède pas de cycle, et dont les arcs sont orientés.… …   Wikipédia en Français

  • Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

  • Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or …   Wikipedia

  • isoprenoid — /uy seuh pree noyd/, adj. Chem. pertaining to, derived from, or similar to isoprene. [1955 60; ISOPRENE + OID] * * * or terpene Class of organic compounds made up of two or more structural units derived from isoprene. Isoprene is a five carbon… …   Universalium

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • heterocyclic compound — Any of a class of organic compounds whose molecules contain one or more rings of atoms with at least one atom (the heteroatom) being an element other than carbon, most frequently oxygen, nitrogen, or sulfur. As in regular cyclic hydrocarbons,… …   Universalium

  • Seifert fiber space — A Seifert fiber space is a 3 manifold together with a nice decomposition as a disjoint union of circles. In other words it is a S^1 bundle (circle bundle) over a 2 dimensional orbifold. Most small 3 manifolds are Seifert fiber spaces, and they… …   Wikipedia

  • Polytree — A simple polytree In graph theory, a polytree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph (DAG) for which there are no undirected cycles either.… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.